Using continuous measurement to protect a universal set of quantum gates within a perturbed decoherence-free subspace

We consider a universal set of quantum gates encoded within a perturbed decoherence-free subspace of four physical qubits. Using second-order perturbation theory and a measuring device modeled by an infinite set of harmonic oscillators, simply coupled to the system, we show that continuous observation of the coupling agent induces inhibition of the decoherence due to spurious perturbations. We thus advance the idea of protecting or even creating a decoherence-free subspace for processing quantum information.Comment: 7 pages, 1 figure. To be published in Journal of Physics A: Mathematical and Genera

Making Classical Ground State Spin Computing Fault-Tolerant

We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal adiabatic quantum computing constructions. In its most primitive form, systems constructed in this model cannot compute in an error free manner when working at non-zero temperature. However, by exploiting a mapping between the partition function for this model and probabilistic classical circuits we are able to show that it is possible to make this model effectively error free. We achieve this by using techniques in fault-tolerant classical computing and the result is that the system can compute effectively error free if the temperature is below a critical temperature. We further link this model to computational complexity and show that a certain problem concerning finite temperature classical spin systems is complete for the complexity class Merlin-Arthur. This provides an interesting connection between the physical behavior of certain many-body spin systems and computational complexity.Comment: 24 pages, 1 figur

Computational Indistinguishability between Quantum States and Its Cryptographic Application

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff coincides with its worst-case hardness; and (iii) QSCDff is computationally at least as hard as the graph automorphism problem in the worst case. These cryptographic properties enable us to construct a quantum public-key cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomial-time quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail proofs and follow-up of recent wor

Quantum algorithm and circuit design solving the Poisson equation

The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum algorithm and a scalable quantum circuit design which approximates the solution of the Poisson equation on a grid with error \varepsilon. We assume we are given a supersposition of function evaluations of the right hand side of the Poisson equation. The algorithm produces a quantum state encoding the solution. The number of quantum operations and the number of qubits used by the circuit is almost linear in d and polylog in \varepsilon^{-1}. We present quantum circuit modules together with performance guarantees which can be also used for other problems.Comment: 30 pages, 9 figures. This is the revised version for publication in New Journal of Physic

Teleportation, Braid Group and Temperley--Lieb Algebra

We explore algebraic and topological structures underlying the quantum teleportation phenomena by applying the braid group and Temperley--Lieb algebra. We realize the braid teleportation configuration, teleportation swapping and virtual braid representation in the standard description of the teleportation. We devise diagrammatic rules for quantum circuits involving maximally entangled states and apply them to three sorts of descriptions of the teleportation: the transfer operator, quantum measurements and characteristic equations, and further propose the Temperley--Lieb algebra under local unitary transformations to be a mathematical structure underlying the teleportation. We compare our diagrammatical approach with two known recipes to the quantum information flow: the teleportation topology and strongly compact closed category, in order to explain our diagrammatic rules to be a natural diagrammatic language for the teleportation.Comment: 33 pages, 19 figures, latex. The present article is a short version of the preprint, quant-ph/0601050, which includes details of calculation, more topics such as topological diagrammatical operations and entanglement swapping, and calls the Temperley--Lieb category for the collection of all the Temperley--Lieb algebra with physical operations like local unitary transformation